Data-Driven Resource Management for Ultra-Dense Small Cells: An Affinity Propagation Clustering Approach
نویسندگان
چکیده
منابع مشابه
Affinity Propagation, and other Data Clustering Techniques
In our research we sought to create implementations of several common clustering algorithms and a relatively new approach called Affinity Propagation. Our objective was to compare the techniques by running tests on one and two dimensional datasets provided by Professor Trono. Dave Kronenberg implemented a standard randomly seeded K-Means clustering program and many related support functions. We...
متن کاملAffinity Propagation: Clustering Data by Passing Messages
AFFINITY PROPAGATION: CLUSTERING DATA BY PASSING MESSAGES Delbert Dueck Doctor of Philosophy Graduate Department of Electrical & Computer Engineering University of Toronto 2009 Clustering data by identifying a subset of representative examples is important for detecting patterns in data and in processing sensory signals. Such “exemplars” can be found by randomly choosing an initial subset of da...
متن کاملAdaptive Affinity Propagation Clustering
Affinity propagation clustering (AP) has two limitations: it is hard to know what value of parameter ‘preference’ can yield an optimal clustering solution, and oscillations cannot be eliminated automatically if occur. The adaptive AP method is proposed to overcome these limitations, including adaptive scanning of preferences to search space of the number of clusters for finding the optimal clus...
متن کاملAPCluster: an R package for affinity propagation clustering
SUMMARY Affinity propagation (AP) clustering has recently gained increasing popularity in bioinformatics. AP clustering has the advantage that it allows for determining typical cluster members, the so-called exemplars. We provide an R implementation of this promising new clustering technique to account for the ubiquity of R in bioinformatics. This article introduces the package and presents an ...
متن کاملSubspace clustering using affinity propagation
This paper proposes a subspace clustering algorithm by introducing attribute weights in the affinity propagation algorithm. A new step is introduced to the affinity propagation process to iteratively update the attribute weights based on the current partition of the data. The relative magnitude of the attribute weights can be used to identify the subspaces in which clusters are embedded. Experi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network Science and Engineering
سال: 2019
ISSN: 2327-4697,2334-329X
DOI: 10.1109/tnse.2018.2842113